package 力扣日常刷题.木23一月.第19天319;

public class Demo94最小路径和 {

    public int minPathSum (int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        int row = grid.length,columns = grid[0].length;
        int[][] dp = new int[row][columns];
        dp[0][0] = grid[0][0];

        for(int i = 1;i < row; i ++){
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }

        for (int i = 0; i < columns; i++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }

        for (int i = 0; i < row; i++) {
            for (int j = 0; j < columns; j++) {
                dp[i][j] = Math.min(dp[i - 1][j],dp[i][j - 1]) + grid[i][j];
            }
        }
        return dp[row - 1][columns - 1];
    }
}
